import java.util.Scanner;

public class Test20230811_2 {
    public static void main(String[] args){
        int [] a={1,2,3,4,5,6,7,8,9};
        Scanner scanner = new Scanner(System.in);
        int n=scanner.nextInt();
        int left = a[0];
        int right = a[a.length-1];
        while(a[left]<=a[right]){
            int mid=a[(left+a.length-1)/2];
         if(n==mid){
             System.out.println("找到了");
             break;
         }
         else if(n>mid){
             mid=a[left+1];
         }
         else{
             mid=a[right-1];
         }
        }
    }
}
